self-avoiding random walks
- self-avoiding random walks
French\ \ aléatoires auto-évitantes promenades
German\ \ Selbst-Vermeidung Irrfahrten
Dutch\ \ zichzelf niet-snijdende stochastische wandelingen
Italian\ \ passegiate aleatorie autovitanti
Spanish\ \ auto-evitando los paseos aleatorios
Catalan\ \ passeig aleatori auto-elusiu
Portuguese\ \ passeios aleatórios auto-excludentes
Romanian\ \ -
Danish\ \ -
Norwegian\ \ -
Swedish\ \ självundvikande slumpvandring
Greek\ \ αυτο-αποφεύγοντας περιπάτους
Finnish\ \ itseään välttelevä satunnaiskulkuprosessi
Hungarian\ \ önelkerülõ véletlen bolyongás
Turkish\ \ öz-kaçınmalı rassal yürüyüşler
Estonian\ \ ennast vältivad juhuslikud ekslemised
Lithuanian\ \ atsitiktinis savęs vengiantis klajojimas
Slovenian\ \ -
Polish\ \ błądzenie losowe samowykluczające się
Russian\ \ случайные самоизбегающие блуждания
Ukrainian\ \ -
Serbian\ \ -
Icelandic\ \ sjálfstætt forðast handahófi gengur
Euskara\ \ -
Farsi\ \ -
Persian-Farsi\ \ -
Arabic\ \ -
Afrikaans\ \ selfvermydende stogastiese bewegings
Chinese\ \ 自 回 避 随 机 走 动 （ 游 动 ）
Korean\ \ 자체갱신 임의[확률]보행
Statistical terms.
2014.
Look at other dictionaries:
Self-avoiding walk — A self avoiding walk (SAW) is a sequence of moves on a lattice which does not visit the same point more than once. A self avoiding polygon (SAP) is a closed () self avoiding walk on a lattice.As such, SAWs are often used to model the real life… … Wikipedia
Random walk — A random walk, sometimes denoted RW, is a mathematical formalization of a trajectory that consists of taking successive random steps. The results of random walk analysis have been applied to computer science, physics, ecology, economics and a… … Wikipedia
Loop-erased random walk — In mathematics, loop erased random walk is a model for a random simple path with important applications in combinatorics and, in physics, quantum field theory. It is intimately connected to the uniform spanning tree, a model for a random tree.… … Wikipedia
Polymer physics — is the field of physics associated to the study of polymers, their fluctuations, mechanical properties, as well as the kinetics of reactions involving degradation and polymerisation of polymers and monomers respectively.While it focuses on an… … Wikipedia
Shortcut model — An important question in statistical mechanics is the dependence of model behaviour on the dimension of the system. The shortcut modelcite journal|author=Shanker, O.|year=2007|title=Graph Zeta Function and Dimension of Complex… … Wikipedia
Markov chain Monte Carlo — MCMC redirects here. For the organization, see Malaysian Communications and Multimedia Commission. Markov chain Monte Carlo (MCMC) methods (which include random walk Monte Carlo methods) are a class of algorithms for sampling from probability… … Wikipedia
Oded Schramm — Born December 10, 1961(1961 12 10) Jerusalem, Israel … Wikipedia
Oded Schramm — (hebräisch עודד שרם; * 10. Dezember 1961 in Jerusalem; † 1. September 2008 am Guye Peak in Washington) war ein israelischer Mathematiker und mathematischer Physiker, der sich vor allem mit mathematischer statistischer P … Deutsch Wikipedia
Gregory F. Lawler — Gregory Francis Lawler (* 14. Juli 1955) ist ein US amerikanischer Mathematiker, der sich mit Wahrscheinlichkeitstheorie beschäftigt. Lawler studierte an der University of Virginia (Bachelor Abschluss 1976) und an der Princeton University, wo er… … Deutsch Wikipedia
Schramm–Loewner evolution — In probability theory, Schramm–Loewner evolution, also known as stochastic Loewner evolution or SLE, is a conformally invariant stochastic process. It is a family of random planar curves that are generated by solving Charles Loewner s… … Wikipedia
Distributed hash table — A distributed hash table (DHT) is a class of a decentralized distributed system that provides a lookup service similar to a hash table; (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value… … Wikipedia
